Regular centralizers of idempotent transformations

نویسندگان

  • Jorge André
  • João Araújo
  • Janusz Konieczny
چکیده

Denote by T (X) the semigroup of full transformations on a set X. For ε ∈ T (X), the centralizer of ε is a subsemigroup of T (X) defined by C(ε) = {α ∈ T (X) : αε = εα}. It is well known that C(idX) = T (X) is a regular semigroup. By a theorem proved by J.M. Howie in 1966, we know that if X is finite, then the subsemigroup generated by the idempotents of C(idX) contains all non-invertible transformations in C(idX). This paper generalizes this result to C(ε), an arbitrary regular centralizer of an idempotent transformation ε ∈ T (X), by describing the subsemigroup generated by the idempotents of C(ε). As a corollary we obtain that the subsemigroup generated by the idempotents of a regular C(ε) contains all non-invertible transformations in C(ε) if and only if ε is the identity or a constant transformation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Residuated Skew Lattice with a Operation

In this paper, we define hedge operation on a residuated skew lattice and investigate some its properties. We get relationships between some special sets as dense, nilpotent, idempotent, regular elements sets and their hedges.  By examples, we show that hedge of a dense element is not a dense and hedge of a regular element is not a regular. Also hedge of a nilpotent element is a nilpotent and h...

متن کامل

Fully idempotent and coidempotent modules

In this paper, the notion of fully idempotent modules is defined and it is shown that this notion inherits most of the essential properties of the usual notion of von Neumann's regular rings. Furthermore, we introduce the dual notion of fully idempotent modules (that is, fully coidempotent modules) and investigate some properties of this class of modules.

متن کامل

Groups That Together with Any Transformation Generate Regular Semigroups or Idempotent Generated Semigroups

Let a be a non-invertible transformation of a finite set and let G be a group of permutations on that same set. Then 〈G, a 〉 \G is a subsemigroup, consisting of all non-invertible transformations, in the semigroup generated by G and a. Likewise, the conjugates ag = g−1ag of a by elements g ∈ G generate a semigroup denoted 〈ag | g ∈ G〉. We classify the finite permutation groups G on a finite set...

متن کامل

Rings in which elements are the sum of an‎ ‎idempotent and a regular element

Let R be an associative ring with unity. An element a in R is said to be r-clean if a = e+r, where e is an idempotent and r is a regular (von Neumann) element in R. If every element of R is r-clean, then R is called an r-clean ring. In this paper, we prove that the concepts of clean ring and r-clean ring are equivalent for abelian rings. Further we prove that if 0 and 1 are the only idempotents...

متن کامل

Orthogonal and Idempotent Transformations for Learning Deep Neural Networks

Identity transformations, used as skip-connections in residual networks, directly connect convolutional layers close to the input and those close to the output in deep neural networks, improving information flow and thus easing the training. In this paper, we introduce two alternative linear transforms, orthogonal transformation and idempotent transformation. According to the definition and pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011